Symbolic computation of derivations using labelled trees
نویسندگان
چکیده
منابع مشابه
Symbolic Computation of Derivations Using Labeled Trees
This paper discusses the effective symbolic computation of operators under composition. Examples include differential operators under composition and vector fields under the Lie bracket. Such operators in general do not commute, but are often rewritten in terms of other operators which do commute. If the original expression enjoys a certain symmetry, then naive rewriting requires the computatio...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملThe symbolic computation of series solutions to ordinary differential equations using trees
In this note, we explain how the algorithms in [111, [5] and [61 immediately give formulas which can be used for the efficient symbolic computation of series expansions to solutions of nonlinear systems of ordinary differential equations. As a by product of this analysis, we derive formulas relating trees to the coefficients of the series expansions, similar to the work by Leroux and Viennot [1...
متن کاملCheap Computation of Optimal Reduced Models Using Symbolic Computation
Many methods have been proposed for the reduction of single-variable and multi-variable systems having ordinary denominators and those having delays in their numerators and denominators. In this paper, an algorithm for this purpose is proposed that can be easily used by anybody with not too advanced knowledge of mathematics yielding optimal reduced models. This algorithm makes use of the symbol...
متن کاملMonotonically labelled Motzkin trees
Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(10)80009-4